Multi-Objective Fault Section Estimation in Distribution Systems Using Elitist NSGA

نویسندگان

  • Anoop Arya
  • Yogendra Kumar
  • Manisha Dubey
  • Radharaman Gupta
چکیده

In this paper, a non-dominated sorting based multi objective EA (MOEA), called Elitist non dominated sorting genetic algorithm (Elitist NSGA) has been presented for solving the fault section estimation problem in automated distribution systems, which alleviates the difficulties associated with conventional techniques of fault section estimation. Due to the presence of various conflicting objective functions, the fault location task is a multiobjective, optimization problem .The considered FSE problem should be handled using Multi objective Optimization techniques since its solution requires a compromise between different criteria. In contrast to the conventional Genetic algorithm (GA) based approach; Elitist NSGA does not require weighting factors for conversion of such a multiobjective optimization problem into an equivalent single objective optimization problem and also algorithm is also equipped with elitism approach. Based on the simulation results on the test distribution system, the performance of the Elitist NSGA based scheme has been found significantly better than that of a conventional GA based method and particle swarm optimization based FSE algorithm. Multi Objective fault section estimation problem have been formulated based on operator experience, customer calls, substation & recloser data. Results are used to reduce the possible number of potential fault location which helps and equipped the operators to locate the fault accurately. KeywordsAutomatic distribution systems, Fault section estimation, Genetic Algorithms, Elitist NSGA, Particle Swarm Optimization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast and Elitist Bi-objective Evolutionary Algorithm for Scheduling Independent Tasks on Heterogeneous Systems

To meet the increasing computational demands, geographically distributed resources need to be logically coupled to make them work as a unified resource. In analyzing the performance of such distributed heterogeneous computing systems scheduling a set of tasks to the available set of resources for execution is highly important. Task scheduling being an NP-complete problem, use of metaheuristics ...

متن کامل

A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II

Abstract. Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algor...

متن کامل

Designing A New Elitist Nondominated Sorted Genetic Algorithm For A Multiobjective Long Term Groundwater Monitoring Application

Although usage of genetic algorithms (GAs) has become widespread, the theoretical work from the genetic and evolutionary computation (GEC) field has been largely ignored by practitioners in realworld applications. This paper provides an overview of a three-step method for utilizing GEC theory to ensure robust search and avoid the common pitfalls in GA applications. Additionally, this study pres...

متن کامل

A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II

Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(mN3) computational complexity (where m is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algo...

متن کامل

Multi-objective MaxiMin Sorting Scheme

Obtaining a well distributed non-dominated Pareto front is one of the key issues in multi-objective optimization algorithms. This paper proposes a new variant for the elitist selection operator to the NSGA-II algorithm, which promotes well distributed non-dominated fronts. The basic idea is to replace the crowding distance method by a maximin technique. The proposed technique is deployed in wel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012